When are Two Numerical Polynomials Relatively Prime?
نویسندگان
چکیده
منابع مشابه
When are Two Numerical Polynomials Relatively Prime?
Let a and b be two polynomials having numerical coeecients. We consider the question: when are a and b relatively prime? Since the coeecients of a and b are approximant, the question is the same as: when are two polynomials relatively prime, even after small perturbations of the coeecients? In this paper we provide a numeric parameter for determining that two polynomials are prime, even under s...
متن کاملThe Probability that Random Polynomials Are Relatively r-Prime
We find the generating function for the number of k-tuples of monic polynomials of degree n over Fq that are relatively r-prime, meaning they have no common factor that is an rth power. A corollary is the probability that k monic polynomials of degree n are relatively r-prime, which we express in terms of a zeta function for the polynomial ring. This gives an analogue of Benkoski’s result conce...
متن کاملA Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials
In this paper we provide a fast, numerically stable algorithm to determine when two given polynomials a and b are relatively prime and remain relatively prime even after small perturbations of their coeecients. Such a problem is important in many applications where input data is only available up to a certain precision. Our method { an extension of the Cabay{Meleshko algorithm for Pad e approxi...
متن کاملPartitions whose parts are pairwise relatively prime
The following problem arose in connection with our research in statistical group theory: estimate a, := the number of partitions of n into parts that are pairwise relatively prime. This differs from most problems in the theory of partitions because of the complicated relationship between the part sixes. We obtain an asymptotic formula for log a,, but leave open the challenging task of obtaining...
متن کاملRelatively prime polynomials and nonsingular Hankel matrices over finite fields
The probability for two monic polynomials of a positive degree n with coefficients in the finite field Fq to be relatively prime turns out to be identical with the probability for an n × n Hankel matrix over Fq to be nonsingular. Motivated by this, we give an explicit map from pairs of coprime polynomials to nonsingular Hankel matrices that explains this connection. A basic tool used here is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1998
ISSN: 0747-7171
DOI: 10.1006/jsco.1998.0234